Composing Nested Web Processes Using Hierarchical Semi-Markov Decision Processes
نویسندگان
چکیده
Many methods proposed for automated composition of Web processes use classical AI planning approaches such as rulebased planning, PDDL, and HTN planning. Web processes generated by classical planning methods suffer from the assumption of deterministic behavior of Web services and do not take into account fundamental QoS issues like service reliability and response time. In this paper, we propose a new model and method based on hierarchical semi-Markov decision processes (H-SMDPs) to address these concerns and handle the composition problem in a more natural and realistic way. We also demonstrate that HSMDP composition outperforms the HTN planning approach in terms of both the optimality of the plan and the robustness to dynamic nature of Web processes.
منابع مشابه
A Hierarchical Framework for Composing Nested Web Processes
Many of the previous methods for composing Web processes utilize either classical planning techniques such as hierarchical task networks (HTNs), or decision-theoretic planners such as Markov decision processes (MDPs). While offering a way to automatically compose a desired Web process, these techniques do not scale to large processes. In addition, classical planners assume away the uncertaintie...
متن کاملAccelerated decomposition techniques for large discounted Markov decision processes
Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...
متن کاملMDPs Semi - Markov decision processes Hidden Markov models Partially observable SMDPs Hierarchical HMMs
متن کامل
Hierarchical Semi-Markov Conditional Random Fields for Recursive Sequential Data
Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirected Markov chains to model complex hierarchical, nested Markov processes. It is parameterised in a discriminative framework and has polynomial time algorithms for learning and inference. Importantly, we develop efficient algorith...
متن کامل